On the logic of cooperation and propositional control
نویسندگان
چکیده
Cooperation logics have recently begun to attract attention within the multi-agent systems community. Using a cooperation logic, it is possible to represent and reason about the strategic powers of agents and coalitions of agents in game-like multi-agent systems. These powers are generally assumed to be implicitly defined within the structure of the environment, and their origin is rarely discussed. In this paper, we study a cooperation logic in which agents are each assumed to control a set of propositional variables—the powers of agents and coalitions then derive from the allocation of propositions to agents. The basic modal constructs in this Coalition Logic of Propositional Control (CL-PC) allow us to express the fact that a group of agents can cooperate to bring about a certain state of affairs. After motivating and introducing CL-PC, we provide a complete axiom system for the logic, investigate the issue of characterising control in CL-PC with respect to the underlying power structures of the logic, and formally investigate the relationship between CL-PC and Pauly’s Coalition Logic. We then show that the model checking and satisfiability problems for CL-PC are both PSPACE-complete, and conclude by discussing our results and how CL-PC sits in relation to other logics of cooperation. 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Equality propositional logic and its extensions
We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...
متن کاملTruth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملA Calculus of Cooperation and Game-Based Reasoning about Protocol Privacy
In 1933, Gödel [9] proposed a translation τ of intuitionistic propositional formulas into a modal language. Formula τ(F ) is obtained from formula F by placing the modality 2 in front of each subformula of formula F . He proved that if F is a theorem in intuitionistic propositional calculus IPL [12], then τ(F ) is provable in modal logic S4. The converse of this statement was later shown by McK...
متن کاملDynamic languages of propositional control for protocol specification
We propose a family of dynamic logics of propositional control. They extend classical propositional logic by a variety of modal operators of assignment, and modal operators of transfer of control over a propositional variable. We also present an extension with operators of knowledge. We essentially focus on their formal properties, stating their complexity and their proof theory.
متن کاملDesign and PLC Implementation for Speed Control of DC Motor using Fuzzy Logic
In this article, a speed control of DC motor is designed and illustrated using fuzzy logic-based programmable logic controller (PLC). The DC motor is an attractive part of electrical equipment in many industrial applications requiring variable speed and load specifications due to its ease of controllability. The designed system is consisted of three main parts including programmable logic contr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Artif. Intell.
دوره 164 شماره
صفحات -
تاریخ انتشار 2005